#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n;
ll m;
int x[N], y[N];
int u, v;
void solve() {
  cin >> n >> m;
  cin >> u >> v;
  rep(i, 0, n - 1) cin >> x[i] >> y[i];
  m %= n * 2;
  rep(i, 0, m - 1) {
    u = x[i % n] * 2 - u;
    v = y[i % n] * 2 - v;
  }
  cout << u << ' ' << v << endl;
  return;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}